Let 1≤p<∞, and let G be a locally compact group. We characterize disjoint hypercyclic weighted translation operators on the Lebesgue space Lp(G) in terms of the weight, the Haar measure, and the group element. Disjoint supercyclic, disjoint mixing, and dual disjoint hypercyclic weighted translation operators are also characterized.

Multicamera vehicle tracking is a necessary part of any video-based intelligent transportation system for extracting different traffic parameters, such as link travel times and origin/destination counts. In many applications, it is needed to locate traffic cameras disjoint from each other to cover a wide area. This paper presents a method for tracking moving vehicles in such camera networks. The proposed method introduces a new method for handling inter-object occlusions, as the most challenging part of the single camera tracking phase. This approach is based on coding the silhouette of moving objects before and after occlusion and separating occluded vehicles by computing the longest common substring of the related chain codes. In addition, to improve the accuracy of the tracking method, in the multicamera phase, a new feature based on the relationships among surrounding vehicles is introduced. The proposed feature is modeled by an exponential distribution and can efficiently improve the efficiency of the appearance (space-time) features when they cannot discriminate between correspondent and non-correspondent vehicles, due to noise or dynamic condition of traffic scenes. A graph-based approach is then used to track vehicles in the camera network. Experimental results show the efficiency of the proposed method.

The aim of this work is to characterize all bounded linear operators $T:\lpi\rightarrow\lpi$ which preserve disjoint support property. We show that the constant coefficients of all isometries on $\lpi$ are in the class of such operators, where $2\neq p\in [1,\infty )$ and $I$ is a non-empty set. We extend preserving disjoint support property to linear operators on $\mathfrak{c}_{0}(I).$ At the end, we obtain some equivalent properties of isometries on Banach spaces.

We denote by LS [N](t, k, v) a large set of t-(v, k, l) designs of size N, which is a partition of all k-subsets of a v-set into N disjoint t-(v, k, l) designs and N=(v-t k-t)/l. We use the notation N (t, v, k, l) as the maximum possible number of mutually disjoint cyclic t-(v, k, l)designs. In this paper we give some new bounds for N (2, 29, 4, 3) and N (2, 31, 4, 2). Consequently we present new large sets LS [9](2, 4, 29), LS [13](2, 4, 29) and LS [7](2, 4, 31), where their existences were already known.